The k-Steiner Ratio in the Rectilinear Plane
نویسندگان
چکیده
Ž . A Steiner minimum tree SMT in the rectilinear plane is the shortest length tree interconnecting a set of points, called the regular points, possibly using Ž . additional vertices. A k-size Steiner minimum tree kSMT is one that can be split into components where all regular points are leaves and all components have at most k leaves. The k-Steiner ratio in the rectilinear plane, r , is the infimum of k the ratios SMTrkSMT over all finite sets of regular points. The k-Steiner ratio is used to determine the performance ratio of several recent polynomial-time approximations for Steiner minimum trees. Previously it was known that in the rectilinear Ž . Ž . Ž . Ž . Ž . plane, r s 2r3, r s 4r5, and 2k y 2 r 2k y 1 F r L F 2k y 1 r 2k for 2 3 k 1 Ž k G 4. In 1991, P. Berman and V. Ramaiyer conjectured that in fact r s 2k y k . Ž . 1 r 2k for k G 4. In this paper we prove their conjecture. Q 1998 Academic Press
منابع مشابه
The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees
We consider the problem of finding a shortest rectilinear Steiner tree for a given set of points in the plane in the presence of rectilinear obstacles that must be avoided. We extend the Steiner ratio to the obstacle-avoiding case and show that it is equal to the Steiner ratio for the obstacle-free case.
متن کاملTwo-level rectilinear Steiner trees
Given a set P of terminals in the plane and a partition of P into k subsets P1, . . . , Pk, a two-level rectilinear Steiner tree consists of a rectilinear Steiner tree Ti connecting the terminals in each set Pi (i = 1, . . . , k) and a top-level tree Ttop connecting the trees T1, . . . , Tk. The goal is to minimize the total length of all trees. This problem arises naturally in the design of lo...
متن کامل1.757 and 1.267 - Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems
The Steiner tree problem requires to nd a shortest tree connecting a given set of terminal points in a metric space. We suggest a better and fast heuristic for the Steiner problem in graphs and in rectilinear plane. This heuristic nds a Steiner tree at most 1.757 and 1.267 times longer than the optimal solution in graphs and rectilinear plane, respectively.
متن کاملSubexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems
A rectilinear Steiner tree for a set T of points in the plane is a tree which connects T using horizontal and vertical lines, In the Rectilinear Steiner Tree problem, input is a set T of n points in the Euclidean plane (R) and the goal is to find an rectilinear Steiner tree for T of smallest possible total length. A rectilinear Steiner arborecence for a set T of points and root r ∈ T is a recti...
متن کاملA catalog of Hanan grid problems
We present a general rectilinear Steiner tree problem in the plane and prove that it is solvable on the Hanan grid of the input points. This result is then used to show that several variants of the ordinary rectilinear Steiner tree problem are solvable on the Hanan grid, including | but not limited to | Steiner trees for rectilinear (or iso-thetic) polygons, obstacle-avoiding Steiner trees, gro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Algorithms
دوره 29 شماره
صفحات -
تاریخ انتشار 1998